A Classification of Viruses Through Recursion Theorems

نویسندگان

  • Guillaume Bonfante
  • Matthieu Kaczmarek
  • Jean-Yves Marion
چکیده

We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose definitions are based on Kleene’s second recursion theorem. We introduce a notion of delayed recursion that we apply to both Kleene’s second recursion theorem and Smullyan’s double recursion theorem. This leads us to define four classes of viruses, two of them being polymorphic. Then, we work on a simple imperative programming language in order to show how those theoretical constructions can be implemented. In particular, we propose a general virus builder, and distribution engines. Topics covered. Computability theoretic aspects of programs, computer virology.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reverse Mathematics and Recursive Graph Theory

We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs, Euler paths, and Hamilton paths. Reverse mathematics provides powerful techniques for analyzing the logical content of theorems. By contrast, recursive mathe...

متن کامل

A Novel Genetic classification of SARS coronavirus-2 following whole nucleic acid and protein alignment of the isolated viruses

Background and aims: The end of 2019 has marked the year, which the human population encountered a novel virus; SARS-CoV-2 that causes a disease namely COVID-19. Here we focused on the genome and protein mutations and subsequently suggested a new classification of the SARS-CoV-2. Materials and Methods: Our study showed that some extra positions in the virus genome play a key role in the SARS-C...

متن کامل

Connections between Romanovski and other polynomials

A connection between Romanovski polynomials and those polynomials that solve the one-dimensional Schrödinger equation with the trigonometric Rosen-Morse and hyperbolic Scarf potential is established. The map is constructed by reworking the Rodrigues formula in an elementary and natural way. The generating function is summed in closed form from which recursion relations and addition theorems fol...

متن کامل

A Method for DMUs Classification in DEA

In data envelopment analysis, anyone can do classification decision units with efficiency scores. It will be interesting if a method for classification of DMUs without regarding to efficiency score is obtained. So in this paper, the classification of Decision Making Units (DMUs) is done according to the additive model without being solved for obtaining scores efficiency. This is because it ...

متن کامل

Kleene's Two Kinds of Recursion

This is an elementary expository article regarding the application of Kleene’s Recursion Theorems in making definitions by recursion. Whereas the Second Recursion Theorem (SRT) is applicable in a first-order setting, the First Recursion Theorem (FRT) requires a higherorder setting. In some cases both theorems are applicable, but one is stronger than the other: the FRT always produces least fixe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007